On modal μ-calculus with explicit interpolants
نویسندگان
چکیده
منابع مشابه
Lectures on the modal μ-calculus
These notes give an introduction to the theory of the modal μ-calculus and other modal fixpoint logics. ∗Institute for Logic, Language and Computation, University of Amsterdam, Science Park 904, NL–1098XH Amsterdam. E-mail: [email protected].
متن کاملProbabilistic Modal μ-Calculus with Independent Product
The probabilistic modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the o...
متن کاملא1 and the Modal μ-Calculus
For a regular cardinal κ, a formula of the modal μ-calculus is κ-continuous in a variable x if, on every model, its interpretation as a unary function of x is monotone and preserves unions of κ-directed sets. We define the fragment Cא1 (x) of the modal μ-calculus and prove that all the formulas in this fragment are א1-continuous. For each formula φ(x) of the modal μ-calculus, we construct a for...
متن کاملAlgorithms for Modal μ-Calculus Interpretation
Modal μ-calculus is a logic that uses min and max fixed point operators (μ, ν). It is very applicable for use in model checking, a promising domain for development, both theoretically and practically. In this essay modal μ-calculus will be defined and several interpretation algorithms will be presented. Some of the algorithms are more or less intuitive, while others involve automata theory and ...
متن کاملThe Modal μ-Calculus Caught Off Guard
The modal μ-calculus extends basic modal logic with secondorder quantification in terms of arbitrarily nested fixpoint operators. Its satisfiability problem is EXPTIME-complete. Decision procedures for the modal μ-calculus are not easy to obtain though since the arbitrary nesting of fixpoint constructs requires some combinatorial arguments for showing the well-foundedness of least fixpoint unfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2006
ISSN: 1570-8683
DOI: 10.1016/j.jal.2005.06.008